A lower bound criterion for iterated commutators
نویسندگان
چکیده
منابع مشابه
A Depth-Five Lower Bound for Iterated Matrix Multiplication
We prove that certain instances of the iterated matrix multiplication (IMM) family of polynomials with N variables and degree n require NΩ( √ n) gates when expressed as a homogeneous depth-five ΣΠΣΠΣ arithmetic circuit with the bottom fan-in bounded by N1/2−ε. By a depth-reduction result of Tavenas, this size lower bound is optimal and can be achieved by the weaker class of homogeneous depth-fo...
متن کاملA New Lower Bound for Completion Time Distribution Function of Stochastic PERT Networks
In this paper, a new method for developing a lower bound on exact completion time distribution function of stochastic PERT networks is provided that is based on simplifying the structure of this type of network. The designed mechanism simplifies network structure by arc duplication so that network distribution function can be calculated only with convolution and multiplication. The selection of...
متن کاملA lower bound for ...
Let A and B be two finite subsets of a field F. In this paper we provide a nontrivial lower bound for |{a + b: a ∈ A, b ∈ B, and P (a, b) 6= 0}| where P (x, y) ∈ F[x, y].
متن کاملA Lower Bound for
It is proved that there is a monotone function in AC(0) 4 which requires exponential size monotone perceptrons of depth 3. This solves the monotone version of a problem which, in the general case, would imply an oracle separation of PPPH.
متن کاملA Lower Bound in the Tail Law of the Iterated Logarithm for Lacunary Trigonometric Series
The law of the iterated logarithm (LIL) first arose in the work of Khintchine [5] who sought to obtain the exact rate of convergence in Borel’s theorem on normal numbers. This result was generalized by Kolmogorov [6] to sums of independent random variables. Recall that an increasing sequence of positive numbers {nk} is said to satisfy the Hadamard gap condition if there exists a q > 1 such that...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Functional Analysis
سال: 2014
ISSN: 0022-1236
DOI: 10.1016/j.jfa.2014.02.015